package queue;

public class MyCircularQueue2 {
    public int[] elem;
    public int front;
    public int rear;
    public boolean isFull;

    public MyCircularQueue2(int k, boolean isFull) {
        elem = new int[k];
        this.isFull = isFull;
    }
    public boolean enQueue(int val) {
        if (isFull) {
            return false;
        }
        elem[rear] = val;
        rear = (rear + 1) % elem.length;
        if (rear == front) {
            isFull = true;
        }
        return true;
    }
    public boolean enQueue2(int val) {
        if (isFull) {
            return false;
        }
        elem[rear] = val;
        rear = (rear + 1) % elem.length;
        if (rear == front) {
            isFull = true;
        }
        return true;
    }
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % elem.length;
        isFull = false;
        return true;
    }
    public int Front() {
        if (isEmpty()) {
            return -1;
        }
        return elem[front];
    }
    public int rear() {
        if (isEmpty()) {
            return -1;
        }
        int index = rear == 0 ? elem.length-1 : rear-1;
        return elem[index];
    }
    public boolean isFull() {
        return isFull;
    }
    public boolean isEmpty() {
        return !isFull && rear == front;
    }
}
